Long arithmetic progressions in sum-sets and the number of x-sum-free sets
نویسنده
چکیده
In this paper we obtain optimal bounds for the length of the longest arithmetic progression in various kinds of sum-sets. As an application, we derive a sharp estimate for the number of sets A of residues modulo a prime n such that no subsum of A equals x modulo n, where x is a fixed residue modulo n.
منابع مشابه
Notes on sum-free and related sets
Our main topic is the number of subsets of 1; n] which are maximal with respect to some condition such as being sum-free, having no number dividing another, etc. We also investigate some related questions. In our earlier paper 8], we considered conditions on sets of positive integers (sum-freeness, Sidon sequences, etc.), and attempted to estimate the number of subsets of 1; n] satisfying each ...
متن کاملBEST APPROXIMATION IN QUASI TENSOR PRODUCT SPACE AND DIRECT SUM OF LATTICE NORMED SPACES
We study the theory of best approximation in tensor product and the direct sum of some lattice normed spacesX_{i}. We introduce quasi tensor product space anddiscuss about the relation between tensor product space and thisnew space which we denote it by X boxtimesY. We investigate best approximation in direct sum of lattice normed spaces by elements which are not necessarily downwardor upward a...
متن کاملOn a generalisation of Roth’s theorem for arithmetic progressions and applications to sum-free subsets
We prove a generalisation of Roth’s theorem for arithmetic progressions to d-configurations, which are sets of the form {ni+nj +a}1≤i≤j≤d with a, n1, ..., nd ∈ N, using Roth’s original density increment strategy and Gowers uniformity norms. Then we use this generalisation to improve a result of Sudakov, Szemerédi and Vu about sum-free subsets [10] and prove that any set of n integers contains a...
متن کاملCounting independent sets in graphs
In this short survey article, we present an elementary, yet quite powerful, method of enumerating independent sets in graphs. This method was first employed more than three decades ago by Kleitman and Winston and has subsequently been used numerous times by many researchers in various contexts. Our presentation of the method is illustrated with several applications of it to ‘real-life’ combinat...
متن کاملOn a Question of Erdős and Moser
For two finite sets of real numbers A and B, one says that B is sum-free with respect to A if the sum set {b + b | b, b ∈ B, b 6= b} is disjoint from A. Forty years ago, Erdős and Moser posed the following question. Let A be a set of n real numbers. What is the size of the largest subset B of A which is sum-free with respect to A? In this paper, we show that any set A of n real numbers contains...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003